Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks
نویسندگان
چکیده
منابع مشابه
A hybrid steepest descent method for constrained convex optimization
This paper describes a hybrid steepest descent method to decrease over time any given convex cost function while keeping the optimization variables into any given convex set. The method takes advantage of properties of hybrid systems to avoid the computation of projections or of a dual optimum. The convergence to a global optimum is analyzed using Lyapunov stability arguments. A discretized imp...
متن کاملGeometric Descent Method for Convex Composite Minimization
In this paper, we extend the geometric descent method recently proposed by Bubeck, Lee and Singh [5] to solving nonsmooth and strongly convex composite problems. We prove that the resulting algorithm, GeoPG, converges with a linear rate (1− 1/√κ), thus achieves the optimal rate among first-order methods, where κ is the condition number of the problem. Numerical results on linear regression and ...
متن کاملSupplementary Material: Geometric Descent Method for Convex Composite Minimization
We argue that the geometric intuition of GeoPG is still clear. Note that we are still constructing two balls that contain x∗ and shrink at the same absolute amount. In GeoPG, since we assume that the smooth function f is strongly convex, we naturally have one ball that contains x∗, and this ball is related to the proximal gradient Gt, instead of the gradient due to the presence of the nonsmooth...
متن کاملSteepest descent method for quasiconvex minimization on Riemannian manifolds
This paper extends the full convergence of the steepest descent algorithm with a generalized Armijo search and a proximal regularization to solve quasiconvex minimization problems defined on complete Riemannian manifolds. Previous convergence results are obtained as particular cases of our approach and some examples in non Euclidian spaces are given.
متن کاملHybrid Steepest Descent Method for Solving Hierarchical Fixed Point Approach to Variational Inequalities Constrained Optimization Problem
An explicit hierarchical fixed point algorithm is introduced to solve the monotone variational inequality over the fixed point set of a nonexpansive mapping. This paper discusses a monotone variational inequality with variational constraint and convex optimization problems over the fixed point set of a nonexpansive mapping. The strong convergence for the proposed algorithm to the solution is gu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2018
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2018.1505885